The UAV Problem is PSPACE-Complete
نویسندگان
چکیده
Consider a finite set of targets, with each target assigned a relative deadline, and each pair of targets assigned a fixed transit flight time. Given a flock of identical UAVs, can one ensure that every target is repeatedly visited by some UAV at intervals of duration at most the target’s relative deadline? The uav Problem is the question of whether this task has a solution. This problem can straightforwardly be solved in PSPACE by modelling it as a network of timed automata. The special case of there being a single UAV is claimed to be NP-complete in the literature. In this paper, we show that the uav Problem is in fact PSPACE-complete even in the single-UAV case.
منابع مشابه
The Cyclic-Routing UAV Problem is PSPACE-Complete
Consider a finite set of targets, with each target assigned a relative deadline, and each pair of targets assigned a fixed transit flight time. Given a flock of identical UAVs, can one ensure that every target is repeatedly visited by some UAV at intervals of duration at most the target’s relative deadline? TheCyclic-Routing UAV Problem (cr-uav) is the question of whether this task has a soluti...
متن کاملBounded-width QBF is PSPACE-complete
Tree-width is a well-studied parameter of structures that measures their similarity to a tree. Many important NP-complete problems, such as Boolean satisfiability (SAT), are tractable on bounded tree-width instances. In this paper we focus on the canonical PSPACE-complete problem QBF, the fully-quantified version of SAT. It was shown by Pan and Vardi that this problem is PSPACE-complete even fo...
متن کاملReachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete
The reachability problem in cooperating systems is known to be PSPACE-complete. We show here that this problem remains PSPACE-complete when we restrict the communication structure between the subsystems in various ways. For this purpose we introduce two basic and incomparable subclasses of cooperating systems that occur often in practice and provide respective reductions. The subclasses we cons...
متن کاملSubsumption of Concepts in FL0y for (Cyclic) Terminologies with Respect to Descriptive Semantics is PSPACE-complete
We close the gap in complexity classification of the subsumption problem in the simple description logic FL0, which allows for conjunctions and universal value restriction only. We prove that subsumption in FL0 is PSPACE-complete when cyclic definitions with descriptive semantics are allowed. Our proof uses automata theory and as a by-product the PSPACE-completeness of a certain decision proble...
متن کاملNotes on Complexity Theory Last updated : October , 2015 Lecture 6
As in our previous study of NP, it is useful to identify those problems that capture the essence of PSPACE in that they are the “hardest” problems in that class. We can define a notion of PSPACE-completeness in a manner exactly analogous to NP-completeness: Definition 1 Language L′ is PSPACE-hard if for every L ∈ PSPACE it holds that L ≤p L′. Language L′ is PSPACE-complete if L′ ∈ PSPACE and L′...
متن کامل